A primal Barvinok algorithm based on irrational decompositions

We introduce variants of Barvinok's algorithm for counting lattice points in polyhedra. The new algorithms are based on irrational signed decomposition in the primal space and the construction of rational generating functions for cones with low index. We give computational results that show that the new algorithms are faster than the existing algorithms by a large factor.Comment: v3: New all-primal algorithm. v4: Extended introduction, updated computational results. To appear in SIAM Journal on Discrete Mathematic

Spherical orbit closures in simple projective spaces and their normalizations

Let G be a simply connected semisimple algebraic group over an algebraically closed field k of characteristic 0 and let V be a rational simple G-module of finite dimension. If G/H \subset P(V) is a spherical orbit and if X is its closure, then we describe the orbits of X and those of its normalization. If moreover the wonderful completion of G/H is strict, then we give necessary and sufficient combinatorial conditions so that the normalization morphism is a homeomorphism. Such conditions are trivially fulfilled if G is simply laced or if H is a symmetric subgroup.Comment: 24 pages, LaTeX. v4: Final version, to appear in Transformation Groups. Simplified some proofs and corrected minor mistakes, added references. v3: major changes due to a mistake in previous version

A combinatorial smoothness criterion for spherical varieties

We suggest a combinatorial criterion for the smoothness of an arbitrary spherical variety using the classification of multiplicity-free spaces, generalizing an earlier result of Camus for spherical varieties of type $A$.Comment: 14 pages, 2 table

Classification of Reductive Monoid Spaces Over an Arbitrary Field

In this semi-expository paper we review the notion of a spherical space. In particular we present some recent results of Wedhorn on the classification of spherical spaces over arbitrary fields. As an application, we introduce and classify reductive monoid spaces over an arbitrary field.Comment: This is the final versio

Effect of magnesium doping on the orbital and magnetic order in LiNiO2

In LiNiO2, the Ni3+ ions, with S=1/2 and twofold orbital degeneracy, are arranged on a trian- gular lattice. Using muon spin relaxation (MuSR) and electron spin resonance (ESR), we show that magnesium doping does not stabilize any magnetic or orbital order, despite the absence of interplane Ni2+. A disordered, slowly fluctuating state develops below 12 K. In addition, we find that magnons are excited on the time scale of the ESR experiment. At the same time, a g factor anisotropy is observed, in agreement with $| 3z^{2}-r^{2}>$ orbital occupancy

Error correction in ensemble registers for quantum repeaters and quantum computers

We propose to use a collective excitation blockade mechanism to identify errors that occur due to disturbances of single atoms in ensemble quantum registers where qubits are stored in the collective population of different internal atomic states. A simple error correction procedure and a simple decoherence-free encoding of ensemble qubits in the hyperfine states of alkali atoms are presented.Comment: 4 pages, 2 figure

Universal Quantum Computation in a Neutral Atom Decoherence Free Subspace

In this paper, we propose a way to achieve protected universal computation in a neutral atom quantum computer subject to collective dephasing. Our proposal relies on the existence of a Decoherence Free Subspace (DFS), resulting from symmetry properties of the errors. After briefly describing the physical system and the error model considered, we show how to encode information into the DFS and build a complete set of safe universal gates. Finally, we provide numerical simulations for the fidelity of the different gates in the presence of time-dependent phase errors and discuss their performance and practical feasibility.Comment: 7 pages, 8 figure